Resource Allocation in CDMA Packet Systems with Maximum Rate Constraint

Scheduling algorithms in CDMA packet systems need to allocate codes and power based on channel state information and queue information. For finite queue sizes, the allocated rate should be less than or equal to the maximum rate required to clear the whole queue. This ensures that resources are not under-utilized. Although queue size and head-of-the-line packet delays have been considered in existing scheduling methods, this maximum rate constraint has not been explicitly enforced. In this paper, we propose a new scheduling algorithm incorporating the maximum rate constraint. The proposed algorithm performs better in terms of delay distribution and percentage of dropped packets compared to existing algorithms that do not directly enforce the maximum rate constraint.